Constraint satisfaction for planning and scheduling problems
نویسندگان
چکیده
منابع مشابه
Introduction to planning, scheduling and constraint satisfaction
Planning, scheduling and constraint satisfaction are important areas in Artificial Intelligence (AI). Many real-world problems are known as AI planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. Therefore, solving these problems requires an adequate mixture of planning, scheduling and resource allocation to competing goal activit...
متن کاملConstraint satisfaction techniques in planning and scheduling
Over the last few years constraint satisfaction, planning, and scheduling have received increased attention, and substantial effort has been invested in exploiting constraint satisfaction techniques when solving real life planning and scheduling problems. Constraint satisfaction is the process of finding a solution to a set of constraints. Planning is the process of finding a sequence of action...
متن کاملTemporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at least two ways: it only considers temporally simple domains and it has restricted decision epochs as the potential happening time of actions. Because of these simplifying assumptions, existing temporal planners are in ...
متن کاملModeling Planning Problems Using Constraint Satisfaction
Planning problems deal with finding a sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. This paper de...
متن کاملProceedings of the 8 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems
Post-optimization through local search is known to be a powerful approach for complex optimization problems. In this paper we tackle the problem of optimizing individual activity plans, i.e., plans that concern activities that one person has to accomplish independently of others, taking into account complex constraints and preferences. Recently, this problem has been addressed adequately using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2011
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-011-9109-4